Cycle stochastic graphs: Structural and forbidden graph characterizations
نویسندگان
چکیده
منابع مشابه
On forbidden subdivision characterizations of graph classes
We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of parameters related to the expansion of a graph) in terms of forbidden subdivisions. Let us start with several definitions. Throughout the paper, we consider only simple undirected graphs. A graph G = sdt(G) is the t-subdivision of a graph G, if G is obtained from G by r...
متن کاملOn minimal forbidden subgraph characterizations of balanced graphs
A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...
متن کاملDegree Powers in Graphs with a Forbidden Even Cycle
Let Cl denote the cycle of length l. For p > 2 and integer k > 1, we prove that the function
متن کاملDegree powers in graphs with forbidden even cycle
Let Cl denote the cycle of length l: For p 2 and integer k 1; we prove that the function (k; p; n) = max <: X u2V (G) d (u) : G is a graph of order n containing no C2k+2 =; satis es (k; p; n) = knp (1 + o (1)) : This settles a conjecture of Caro and Yuster. Our proof is based on a new su¢ cient condition for long paths, that may be useful in other applications as well.
متن کاملVertex arboricity of toroidal graphs with a forbidden cycle
The vertex arboricity a(G) of a graph G is the minimum k such that V (G) can be partitioned into k sets where each set induces a forest. For a planar graph G, it is known that a(G) ≤ 3. In two recent papers, it was proved that planar graphs without k-cycles for some k ∈ {3, 4, 5, 6, 7} have vertex arboricity at most 2. For a toroidal graph G, it is known that a(G) ≤ 4. Let us consider the follo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2020.01.004